Telescope Network Scheduling - Rationale and Formalisms
نویسندگان
چکیده
Scheduling of university and institutional telescopes is typically performed manually, and astronomers are used to interacting with a human to explain their requirements for resources and time. Las Cumbres Observatory Global Telescope (LCOGT) is deploying a worldwide network of robotic telescopes. At LCOGT manual scheduling is infeasible due to: 1) the number of resources and observations that must be scheduled, 2) the scheduling-time dependencies that arise when concurrent or consecutive access to telescopes is required, and 3) the need to rapidly re-calculate the schedule to accommodate near-real-time requests from high priority observing programmes (e.g. transient followup programmes), and changing resource availability due to weather and other reasons. In this paper we develop a formalism capable of expressing the complex requirements and preferences of astronomers concerning resource and time allocation on a telescope network, and formulate the offline telescope network scheduling problem as the problem of choosing and scheduling (i.e. assigning concrete start and end times to) a maximum priority, non-overlapping subset of an input list of requests.
منابع مشابه
An Integer Linear Programming Solution to the Telescope Network Scheduling Problem
Telescope networks are gaining traction due to their promise of higher resource utilization than single telescopes and as enablers of novel astronomical observation modes. However, as telescope network sizes increase, the possibility of scheduling them completely or even semi-manually disappears. In an earlier paper, a step towards software telescope scheduling was made with the specification o...
متن کاملDouble-Star Detection Using Convolutional Neural Network in Atmospheric Turbulence
In this paper, we investigate the usage of machine learning in the detection and recognition of double stars. To do this, numerous images including one star and double stars are simulated. Then, 100 terms of Zernike expansion with random coefficients are considered as aberrations to impose on the aforementioned images. Also, a telescope with a specific aperture is simulated. In this work, two k...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملAas 13-359 Autonomy Architecture for a Raven-class Telescope with Space Situational Awareness Applications
This paper investigates possible autonomy architecture designs of a Raven-class telescope as applied to the tracking and high level characterization problem in Space Situational Awareness (SSA). Various levels of autonomy are defined and existing systems and capabilities are discussed. Telescope interactions with distributed sensor networks such as the Space Surveillance Network (SSN) are revie...
متن کاملScheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013